Characterizing Star-PCGs
نویسندگان
چکیده
A graph G is called a pairwise compatibility graph (PCG, for short) if it admits a tuple (T,w, dmin, dmax) of a tree T whose leaf set is equal to the vertex set of G, a non-negative edge weight w, and two non-negative reals dmin ≤ dmax such that G has an edge between two vertices u, v ∈ V if and only if the distance between the two leaves u and v in the weighted tree (T, w) is in the interval [dmin, dmax]. The tree T is also called a witness tree of the PCG G. The problem of testing if a given graph is a PCG is not known to be NP-hard yet. To obtain a complete characterization of PCGs is a wide open problem in computational biology and graph theory. In literature, most witness trees admitted by known PCGs are stars and caterpillars. In this paper, we give a complete characterization for a graph to be a star-PCG (a PCG that admits a star as its witness tree), which provides us the first polynomial-time algorithm for recognizing star-PCGs.
منابع مشابه
Computational identifying and characterizing circular RNAs and their associated genes in hepatocellular carcinoma
Hepatocellular carcinoma (HCC) is currently still a major factor leading to death, lacking of reliable biomarkers. Therefore, deep understanding the pathogenesis for HCC is of great importance. The emergence of circular RNA (circRNA) provides a new way to study the pathogenesis of human disease. Here, we employed the prediction tool to identify circRNAs based on RNA-seq data. Then, to investiga...
متن کاملOn the Pairwise Compatibility Property of some Superclasses of Threshold Graphs
A graph G is called a pairwise compatibility graph (PCG) if there exists a positive edge weighted tree T and two non-negative real numbers dmin and dmax such that each leaf lu of T corresponds to a node u ∈ V and there is an edge (u, v) ∈ E if and only if dmin ≤ dT (lu, lv) ≤ dmax, where dT (lu, lv) is the sum of the weights of the edges on the unique path from lu to lv in T . In this paper we ...
متن کاملParse Trees and Unique Queries in Context-Free Parallel Communicating Grammar Systems
Parallel communicating grammar systems (PCGS) were introduced awhile ago purportedly to analyze concurrent systems on a language-theoretic level. To our knowledge however no actual relationship between PCGS and practical computing systems was ever investigated. We believe that PGCSwith context-free components (CF-PCGS) have high practical potential, especially in the area of formal methods, so ...
متن کاملEfficacy of glucosamine plus diacerein versus monotherapy of glucosamine: a double-blind, parallel randomized clinical trial
BACKGROUND Patented crystalline glucosamine sulfate (pCGS) and diacerein monotherapy have been recommended for treatment of mild to moderate osteoarthritis (OA), but evidence of efficacy for combined treatments is lacking. Therefore, the aim of this study was to compare clinical outcomes (i.e., pain and Western Ontario and McMaster Universities Osteoarthritis Index [WOMAC] score) at 6 months as...
متن کاملAnalysis of the structure of the Krylov subspace in various preconditioned CGS algorithms
An improved preconditioned CGS (PCGS) algorithm has recently been proposed, and it performs much better than the conventional PCGS algorithm. In this paper, the improved PCGS algorithm is verified as a coordinative to the left-preconditioned system; this is done by comparing, analyzing, and executing numerical examinations of various PCGS algorithms, including the most recently proposed one. We...
متن کامل